On the dynamical behavior of chaotic cellular automata
نویسندگان
چکیده
منابع مشابه
Dynamical Behavior of Cellular Automata
Cellular Automata are simple computational models which can be leveraged to model a wide variety of dynamical systems. Composed of a lattice of discrete cells that take finite number of states based on previous iterations these models differ greatly from dynamic systems that vary continuously in space or time. However given their ability to model many of continuous systems, it could be postulat...
متن کاملChaotic behavior in the disorder cellular automata
Disordered cellular automata (DCA) represent an intermediate class between elementary cellular automata and the Kauffman network. Recently, Rule 126 of DCA has been explicated: the system can be accurately described by a discrete probability function. However, a means of extending to other rules has not been developed. In this investigation, a density map of the dynamical behavior of DCA is for...
متن کاملDynamical behavior and synchronization of chaotic chemical reactors model
In this paper, we discuss the dynamical properties of a chemical reactor model including Lyapunov exponents, bifurcation, stability of equilibrium and chaotic attractors as well as necessary conditions for this system to generate chaos. We study the synchronization of chemical reactors model via sliding mode control scheme. The stability of proposed method is proved by Barbalate’s lemma. Numeri...
متن کاملComplex Chaotic Behavior of a Class of Subshift Cellular Automata
A class of parameterized boolean, one-dimensional, biinfinite cellular autom at a has been st udied and t heir behavior observed when some param eters of the local funct ion are changed. T hese aut omata are equivalent to a par t icular class of boolean neural networks and t he change in t he parameters corresponds to a change in the symmetricity of t he connect ion matrix. T he purpo se is to ...
متن کاملAnalysis of Elementary Cellular Automata Chaotic Rules Behavior
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00149-2